Weakly Semirecursive Sets and r.e. Orderings
نویسندگان
چکیده
Kummer, M. and F. Stephan, Weakly semirecursive sets and r.e. orderings, Annals of Pure and Applied Logic 60 (1993) 133-150. Weakly semirecursive sets have been introduced by Jockusch and Owings (1990). In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive sets.
منابع مشابه
Reducibilities in L Rafr 1 Recursive Function Theory
REDUCIBILITIES IN RECURSIVE FUNCTION THEORY Carl Groos Jockusch, Jr. Submitted to the Department of Mathematics on May 13, 1966 in partial fulfillment of the requirements for the degree of Doctor of Philosophy. In this dissertation some reducibilities of recursive function theory are analyzed, with particular emphasis on the relationships between many-one reducibility and various kinds of truth...
متن کاملOn the Query Complexity of Sets
There has been much research over the last eleven years that considers the number of queries needed to compute a function as a measure of its complexity. We are interested in the complexity of certain sets in this context. We study the sets If A = K or A is semirecursive, we obtain tight bounds on the query complexity of ODD A n and WMOD(m) A n. We obtain lower bounds for A r.e. The lower bound...
متن کاملThe Complexity of ODDn
For a fixed set A, the number of queries to A needed in order to decide a set S is a measure of S’s complexity. We consider the complexity of certain sets defined in terms of A: ODDn = {(x1, . . . , xn) : #n (x1, . . . , xn) is odd} and, for m ≥ 2, MODmn = {(x1, . . . , xn) : #n (x1, . . . , xn) 6≡ 0 (mod m)}, where #n (x1, . . . , xn) = A(x1) + · · ·+A(xn). (We identify A(x) with χA(x), where ...
متن کاملClosed Left-R.E. Sets
A set is called r-closed left-r.e. iff every set r-reducible to it is also a left-r.e. set. It is shown that some but not all left-r.e. cohesive sets are many-one closed left-r.e. sets. Ascending reductions are many-one reductions via an ascending function; left-r.e. cohesive sets are also ascending closed left-r.e. sets. Furthermore, it is shown that there is a weakly 1-generic many-one closed...
متن کاملA new order theory of set systems and better quasi-orderings
By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of abstract independent set), we define the order type dimL ofL to be the order type of the game tree. The theory of this new order type and continuous, monotone function between set systems corresponds to the theory of well quasi-orderings (WQOs). As Nash-Williams developed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 60 شماره
صفحات -
تاریخ انتشار 1993